Reciprocal distance energy of complete multipartite graphs

In this paper, first we compute the energy of a special partitioned matrix under some cases. As consequence, obtain reciprocal distance complete multipartite graph and also give various other energies graphs. Next, show that among all [Formula: see text]-partite graphs on text] vertices, split has minimum is maximum for Turan text]. At last, it shown bipartite decreases deletion an edge if text], increases Also, tripartite does not increase deletion.